Block Runge-Kutta Methods on Parallel Computers
نویسندگان
چکیده
منابع مشابه
Runge-Kutta-Nyström-type parallel block predictor-corrector methods
This paper describes the construction of block predictor-corrector methods based on Runge-Kutta-Nystrr om correctors. Our approach is to apply the predictor-corrector method not only with stepsize h, but, in addition (and simultaneously) with stepsizes a i h; i = 1; : : :; r. In this way, at each step, a whole block of approximations to the exact solution at oo-step points is computed. In the n...
متن کاملEmbedded Diagonally Implicit Runge - Kutta Algorithms on Parallel Computers
This paper investigates diagonally implicit Runge-Kutta methods in which the implicit relations can be solved in parallel and are singly diagonalimplicit on each processor. The algorithms are based on diagonally implicit iteration of fully implicit Runge-Kutta methods of high order. The iteration scheme is chosen in such a way that the resulting algorithm is ^(a)-stable or Z,(a)-stable with a e...
متن کاملParallel Iterated Runge Kutta Methods and Applications
The iterated Runge Kutta IRK method is an iteration scheme for the numerical solu tion of initial value problems IVP of ordinary di erential equations ODEs that is based on a predictor corrector method with an Runge Kutta RK method as corrector Embed ded approximation formulae are used to control the stepsize We present di erent parallel algorithms of the IRK method on distributed memory multip...
متن کاملParallel Execution of Embedded Runge-Kutta Methods
In this paper, we consider the parallel solution of nonstii ordinary diierential equations with two diierent classes of Runge-Kutta (RK) methods providing embedded solutions: classical embedded RK methods and iterated RK methods which were constructed especially for parallel execution. For embedded Runge-Kutta methods, mainly the potential system parallelism is exploited. Iterated RK methods pr...
متن کاملRunge{kutta Methods on Manifolds
The subject matter of this paper is the recovery of invariants and conservation laws of ordinary diierential systems by numerical methods. We prove that the most likely candidates for this task, Runge{Kutta schemes, fail to stay on manifolds deened by r-tensors with r 3. As an alternative, we suggest diieomorphically mapping complicated man-ifolds to simpler ones. This procedure allows for reco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik
سال: 1992
ISSN: 0044-2267,1521-4001
DOI: 10.1002/zamm.19920720102